On minimal blocks
نویسندگان
چکیده
منابع مشابه
Artistic minimal rendering with lines and blocks
Many non-photorealistic rendering techniques exist to produce artistic effects from given images. Inspired by various artists, interesting effects can be produced by using a minimal rendering, where the minimum refers to the number of tones as well as the number and complexity of the primitives used for rendering. Our method is based on various computer vision techniques, and uses a combination...
متن کاملA Catalog of Minimal Blocks * Arthur
The majority of the definitions used here will be found in (3),1 with the terms "point", "line", and "cycle" replaced by vertex, edge, and circuit. In particular, a block is a connected graph with no cut vertex, and a block is minimal if no spanning subgraph of the block with fewer edges is also a block. We consider the graph with one vertex and no edges (the vertex graph) and the graph with tw...
متن کاملOn the Blocks of Interpoint Distances
We study the blocks of interpoint distances, their distributions, correlations, independence and the homogeneity of their total variances. We discuss the exact and asymptotic distribution of the interpoint distances and their average under three models and provide connections between the correlation of interpoint distances with their vector correlation and test of sphericity. We discuss testing...
متن کاملExtended Minimal Routing in 2-D Meshes with Faulty Blocks
In this paper, several enhanced sufficient conditions are given for minimal routing in 2-dimensional (2-D) meshes with faulty nodes contained in a set of disjoint faulty blocks. It is based on an early work of Wu’s minimal routing in 2D meshes. Fault information is coded in a 4-tuple called extended safety level associated with each node to determine the feasibility of minimal routing. Specific...
متن کاملminimal, vertex minimal and commonality minimal cn-dominating graphs
we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1968
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1968-0228369-8